Collusion-Free Privacy Preserving Data Mining
ثبت نشده
چکیده
Distributed association rule mining is an integral part of data mining that extracts useful information hidden in distributed data sources. As local frequent itemsets are globalized from data sources, sensitive information about individual data sources needs high protection. Different privacy preserving data mining approaches for distributed environment have been proposed but in the existing approaches, collusion among the participating sites reveal sensitive information about the other sites. In this paper, the authors propose a collusion-free algorithm for mining global frequent itemsets in a distributed environment with minimal communication among sites. This algorithm uses the techniques of splitting and sanitizing the itemsets and communicates to random sites in two different phases, thus making it difficult for the colluders to retrieve sensitive information. Results show that the consequence of collusion is reduced to a greater extent without affecting mining performance and confirms optimal communication among sites.
منابع مشابه
Mining Frequent Itemsets in Presence of Malicious Participants
Privacy Preserving Data Mining (PPDM) algorithms attempt to reduce the injuries to privacy caused by malicious parties during the rule mining process. Usually, these algorithms are designed for the semi-honest model, where participants do not deviate from the protocol. However, in the real-world, malicious parties may attempt to obtain the secret values of other parties by probing attacks or co...
متن کاملCollusion-Free Privacy Preserving Data Mining
Distributed association rule mining is an integral part of data mining that extracts useful information hidden in distributed data sources. As local frequent itemsets are globalized from data sources, sensitive information about individual data sources needs high protection. Different privacy preserving data mining approaches for distributed environment have been proposed but in the existing ap...
متن کاملP3ARM-t: Privacy-Preserving Protocol for Association Rule Mining with t Collusion Resistance
The ability to mine large volumes of distributed datasets enables more precise decision making. However, privacy concerns should be carefully addressed when mining datasets distributed over autonomous sites. We propose a new cryptography-based Privacy-Preserving Protocol for Association Rule Mining with t collusion resistance (P3ARM-t), where t is the threshold of number of colluding sites. P3A...
متن کاملAn Efficient Approach for Privacy Preserving Distributed K-Means Clustering Based on Shamir's Secret Sharing Scheme
Privacy preserving data mining has gained considerable attention because of the increased concerns to ensure privacy of sensitive information. Amongst the two basic approaches for privacy preserving data mining, viz. Randomization based and Cryptography based, the later provides high level of privacy but incurs higher computational as well as communication overhead. Hence, it is necessary to ex...
متن کاملPrivacy-Preserving Mining of Association Rules on Distributed Databases
Data mining techniques can extract hidden but useful information from large databases. Most efficient approaches for mining distributed databases suppose that all of the data at each site can be shared. However, source transaction databases usually include very sensitive information. In order to obtain an accurate mining result on distributed databases and to preserve the private data that is a...
متن کامل